Towards Optimal Two-Dimensional Indexing for Constraint Databases
نویسندگان
چکیده
We address the problem of indexing conjunctions of linear constraints with two variables. We show how containment and intersection selection problems for constraint databases can be reduced to the point location problem by using a dual transformation. The proposed representation is then used to develop an eecient secondary storage solution for one important particular indexing case.
منابع مشابه
Approximation Techniques for Indexing Two-Dimensional Constraint Databases
Constraint databases have recently been proposed as a powerful framework to model and retrieve spatial data. The use of constraint databases should be supported by access data structures that make effective use of secondary storage and reduce query processing time. In this paper, we consider the indexing problem for objects represented by conjunctions of two-variable linear constraints and we a...
متن کاملIndexing Constraint Databases by Using a Dual Representation
Linear constraint databases are a powerful framework to model spatial and temporal data. The use of constraint databases should be supported by access data structures that make effective use of secondary storage and reduce query processing time. Such structures should be able to store both finite and infinite objects and perform both containment (ALL) and intersection (EXIST) queries. As standa...
متن کاملIndexing for Data Models with Classes and Constraints
We examine I/O-efficient data structures that provide indexing support for new data models. The database languages of these models include concepts from constraint programming (e.g., relational tuples are generalized to conjunctions of constraints) and from object-oriented programming (e.g., objects are organized in class hierarchies). Indexing by one attribute in many constraint data models is...
متن کاملA novel indexing approach for multimedia image databases
This paper proposes an algorithm for Content-based Image Indexing whose formulation of similarity is borrowed from methods for fractal compression. Unlike most traditional block-based image indexing algorithms, the proposed method employs dynamic programming to exploit inter-block dependencies. A regularization constraint is globally imposed, and the overall optimal transformation relating two ...
متن کاملOptimal Design of Geometrically Nonlinear Structures Under a Stability Constraint
This paper suggests an optimization-based methodology for the design of minimum weight structures with kinematic nonlinear behavior. Attention is focused on three-dimensional reticulated structures idealized with beam elements under proportional static loadings. The algorithm used for optimization is based on a classical optimality criterion approach using an active-set strategy for extreme lim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 64 شماره
صفحات -
تاریخ انتشار 1997